Eecient, Protected Message Interface in the Mit M-machine
نویسندگان
چکیده
We present a user-level message interface that provides high performance and very low processor overhead. In this system, messages are launched from within the user's general register le, and received in a hardware queue mapped to a general register. A message handler is started within the latency of a jump instruction upon arrival of the rst message word, up to 18 faster than conventional interrupt-driven interfaces. These tightly-integrated mechanisms feature end-to-end latencies as low as nearly one quarter that of memory-mapped interfaces. Copying is eliminated in these mechanisms, reducing processor occupancy by up to one-third when compared with other integrated register-mapped systems. The interface also features a low overhead, robust protection model using virtually-addressed message destinations and certiied trusted handlers. Both are speciied with unforgeable pointers, enabling ne-grain control over a user thread's accessible domain as well as its permitted remote operations. We discuss the application of this system in the framework of the multithreaded MIT M-Machine, and show that unlike other approaches, it is able to provide protection and avoid starvation while maintaining high eeciency.
منابع مشابه
Fast Message Passing via the ALLCACHE Memory on KSR Computers
A large body of applications have been built which use a message-passing style of inter-process communication. Thus, it is important to be able to support eecient message-passing even on shared-memory computers. Unfortunately, `direct' porting of message-passing packages to shared-memory computers invariably produces unacceptably poor performance. In this paper, we discuss schemes for eeciently...
متن کاملGRADE: A graphical programming environment for PVM applications
The PVM system { which is one of the most popular message-passing interface currently { represents a low-level tool that enables to write parallel programs but misses the high-level support which could make this work acceptable easy and eecient. To provide high-level graphical support for PVM based program development , a complex programming environment (GRADE) is being developed. GRADE provide...
متن کاملImplementing a Low Cost , Low Latency
The cost of high-performance parallel platforms prevents parallel processing techniques from spreading in present applications. Networks of Workstations (NOW) exploiting oo-the-shelf communication hardware, high-end PCs and standard communication software provide much cheaper but poorly performing parallel platforms. In our NOW prototype called GAMMA (Genoa Active Message MAchine) every node is...
متن کاملAn Efficient, Protected Message Interface
69 I n traditional message interfaces, high latency and processor occupancy inhibit our ability to exploit large-scale parallelism. Even though recent designs address this problem by removing OS layers from the interface, 1-5 the remaining overhead is still large. To amortize communication overhead of hundreds of cycles, programmers use messages that are hundreds to thousands of words in size. ...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کامل